A -to-CL Translation for Strong Normalization
نویسنده
چکیده
We introduce a simple translation from -calculus to combinatory logic (cl) such that: A is an sn -term i the translation result of A is an sn term of cl (the reductions are -reduction in -calculus and weak reduction in cl). None of the conventional translations from -calculus to cl satisfy the above property. Our translation provides a simpler sn proof of Godel's -calculus by the ordinal number assignment method. By using our translation, we construct a homomorphism from a conditionally partial combinatory algebra which arises over sn -terms to a partial combinatory algebra which arises over sn cl-terms.
منابع مشابه
A note on strong normalization in classical natural deduction
In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction. Once the translation is extended to proofs, it obtains a reduction of provability to provability in the disjunction-free subsystem. It is natural to ask whether a r...
متن کاملStrong normalization results by translation
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed λμ-calculus. We also extend Mendler’s result on recursive equations to this system.
متن کاملA Beam-Search Decoder for Normalization of Social Media Text with Application to Machine Translation
Social media texts are written in an informal style, which hinders other natural language processing (NLP) applications such as machine translation. Text normalization is thus important for processing of social media text. Previous work mostly focused on normalizing words by replacing an informal word with its formal form. In this paper, to further improve other downstream NLP applications, we ...
متن کاملStrong normalization proofs by CPS-translations
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system λμ→∧∨⊥ , which is introduced in [3] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions by the Curry-Howard isomorphism. For our method, we introduce a new CPS-translati...
متن کاملTranslation of rst-class environments to records
We have studied a calculus with rst-class environments which originates from the -calculus. We give a translation of the calculus to a record calculus and show fundamental properties by using the translation. First we give a translation of simply typed calculus ! env into simply-typed record calculus ! record , which is used for proving strong normalization of ! env . Second we introduce a tran...
متن کامل